|
|
Demonstration of an Indexing Algorithm kD Tree and Its Derivatives
Foukal, Tomáš ; Květoňová, Šárka (referee) ; Kolář, Dušan (advisor)
This thesis deals with analysis, designing and implementation of an application for teaching of indexing algorithm kD Tree and its derivates. Also, it deals with testing the application, describing of its use and including examples with exact data. Application as well offers a~possibility of running of algorithms step-by-step and their visualization with a graphical user interface. During development, the emphasis was on executability of the application in all major web browsers.
|
|
|
Ray Tracing Using k-D Tree
Musil, Petr ; Jošth, Radovan (referee) ; Havel, Jiří (advisor)
This thesis describes the design and implementation of an application for picture synthesis using ray tracing. The goal is to verify properties of an space subdivision optimalization method using KD tree. The work compares spatial median, objects median and cost model methods for splitting plane determination during KD-tree construction. Several test scenes are used for evaluation.
|
|
|
Building kD Tree on GPU
Bajza, Jakub ; Kula, Michal (referee) ; Kobrtek, Jozef (advisor)
This term project addresses the construction of kD tree acceleration structures and parallelization of this construction using GPU. At the beginning, there is an introduction of the reader into CUDA platform for parallel programming. There is a decription of generic principles as well as specific features that will be used in this thesis. Following that the reader is put into the issue of acceleration structures for Ray tracing. These structures are described and the kD tree acceleration structure and its variants are portrayed in detail. After that the analysis of chosen kD tree variant is broken down and the problems and issuse of its parallel implementation are adressed. As a part of implementation discription, there is a short descripton of CPU variant and detailed specifications of the CUDA kernels. The testing section brings the results of implementation in form of CPU vs GPU comparison, as well as evaluation of how much the metric set in design was fulfilled. In the end there is a summary of achieved goals and results followed by possible future improvements for the implementation.
|
|
|
Photorealistic rendering
Hošala, Michal ; Pelikán, Josef (advisor) ; Pavlík, Ivo (referee)
Goal of this thesis is to provide theoretical basis for implementation of the software to be used for rendering of the photorealistic images. Application based on described theoretical background is also part of this thesis. Photorealism is achieved by describing the light and materials in the scene, togehther with proper investigation of their interactions, by using as accurate physics/optics as possible, according to the real world properties. Thesis also aims on handling and following rendering of all kinds of illumination, including indirect illumination, which is often as important component of the final images as direct illumination.
|
|
|
Demonstration of an Indexing Algorithm kD Tree and Its Derivatives
Foukal, Tomáš ; Květoňová, Šárka (referee) ; Kolář, Dušan (advisor)
This thesis deals with analysis, designing and implementation of an application for teaching of indexing algorithm kD Tree and its derivates. Also, it deals with testing the application, describing of its use and including examples with exact data. Application as well offers a~possibility of running of algorithms step-by-step and their visualization with a graphical user interface. During development, the emphasis was on executability of the application in all major web browsers.
|
|
|
Building kD Tree on GPU
Bajza, Jakub ; Kula, Michal (referee) ; Kobrtek, Jozef (advisor)
This term project addresses the construction of kD tree acceleration structures and parallelization of this construction using GPU. At the beginning, there is an introduction of the reader into CUDA platform for parallel programming. There is a decription of generic principles as well as specific features that will be used in this thesis. Following that the reader is put into the issue of acceleration structures for Ray tracing. These structures are described and the kD tree acceleration structure and its variants are portrayed in detail. After that the analysis of chosen kD tree variant is broken down and the problems and issuse of its parallel implementation are adressed. As a part of implementation discription, there is a short descripton of CPU variant and detailed specifications of the CUDA kernels. The testing section brings the results of implementation in form of CPU vs GPU comparison, as well as evaluation of how much the metric set in design was fulfilled. In the end there is a summary of achieved goals and results followed by possible future improvements for the implementation.
|
|
|
Raytracing on GPU
Straňák, Marek ; Jošth, Radovan (referee) ; Polok, Lukáš (advisor)
Raytracing is a basic technique for displaying 3D objects. The goal of this thesis is to demonstrate the possibility of implementing raytracer using a programmable GPU. The algorithm and its modified version, implemented using "C for CUDA" language, are described. The raytracer is focused on displaying dynamic scenes. For this purpose the KD tree structure, bounding volume hierarchies and PBO transfer are used. To achieve realistic output, photon mapping was implemented.
|
|
|
Ray Tracing Using k-D Tree
Musil, Petr ; Jošth, Radovan (referee) ; Havel, Jiří (advisor)
This thesis describes the design and implementation of an application for picture synthesis using ray tracing. The goal is to verify properties of an space subdivision optimalization method using KD tree. The work compares spatial median, objects median and cost model methods for splitting plane determination during KD-tree construction. Several test scenes are used for evaluation.
|
guest ::
